package com.example.leetcode.dp;

import com.example.leetcode.array.common.ArrayUtils;
import com.example.leetcode.dp.common.DPUtils;

import java.util.List;

class Solution120 {
    public int minimumTotal(List<List<Integer>> triangle) {
        return DPUtils.minimumTotal(triangle);
    }
}

public class leetcode120 {
    public static void main(String[] args) {
        Solution120 solution120 = new Solution120();
        int[][] triangle = {{2}, {3, 4}, {6, 5, 7}, {4, 1, 8, 3}};
        System.out.println(solution120.minimumTotal(ArrayUtils.convertArrayToList(triangle)));
    }
}
